Session Types in Abelian Logic
نویسنده
چکیده
There was a PhD student who says “I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes.” We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky’s linear lambda calculus LF and characterizes Abelian logic.
منابع مشابه
Linear logic propositions as session types
Throughout the years, several typing disciplines for the π-calculus have been proposed. Arguably, the most widespread of these typing disciplines consists of session types. Session types describe the input/output behavior of processes and traditionally provide strong guarantees about this behavior (i.e., deadlock freedom and fidelity). While these systems exploit a fundamental notion of lineari...
متن کاملSoft Session Types
We show how systems of session types can enforce interactions to be bounded for all typable processes. The type system we propose is based on Lafont’s soft linear logic and is strongly inspired by recent works about session types as intuitionistic linear logic formulas. Our main result is the existence, for every typable process, of a polynomial bound on the length of any reduction sequence sta...
متن کاملSoft Session Types (Long Version)
We show how systems of session types can enforce interactions to be bounded for all typable processes. The type system we propose is based on Lafont’s soft linear logic and is strongly inspired by recent works about session types as intuitionistic linear logic formulas. Our main result is the existence, for every typable process, of a polynomial bound on the length of reduction sequences starti...
متن کاملLogic-Based Domain-Aware Session Types
In prior work, an interpretation of linear logic propositions as session types for communicating processes was proposed. In a concurrent setting, it defines a tight propositions-as-types/proofs-as-programs correspondence, in the style of the CurryHoward isomorphism. In this paper, we generalize such an interpretation by relying on a variant of intuitionistic linear logic with hybrid logic const...
متن کاملCoinductive Session Types in Higher-Order Communication Centric Programs
We develop a theory of coinductive session types based on prior work on computational interpretations of linear logic propositions as session types. Unlike other more ad-hoc approaches to recursive session types, our typing discipline supports the compositional definition of potentially infinite interactive behaviour, as required to model realistic distributed systems, while remarkably forbiddi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013